package easy;

import javax.swing.tree.TreeNode;

public class a530_二叉搜索树的最小绝对差 {
    public int getMinimumDifference(TreeNode root) {
        return 0;
    }
}
